Optical generation of Voronoi diagram
نویسندگان
چکیده
منابع مشابه
Voronoi diagram generation on the ellipsoidal earth
Voronoi diagram on the earth surface is a powerful tool to study spatial proximity at continental or global scale. However, its computation remains challenging because geospatial features have complex shapes. This paper presents a raster-based algorithm to generate Voronoi diagrams on earth's surface. The algorithm approximates the exact point-to-point geographical distances using the cell-to-c...
متن کاملEfficient computation of clipped Voronoi diagram for mesh generation
The Voronoi diagram is a fundamental geometric structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact domain (i.e. a bounded and closed 2D region or a 3D volume), some Voronoi cells of their Voronoi diagram are infinite or partially outside of the domain, but in practice only the parts of the cells inside the domain are ...
متن کاملVoronoi Diagram Generation Algorithm based on Delaunay Triangulation
Voronoi diagram and its geometric dual, the Delaunay triangulation, both are practical geometric constructions which have been applied extensively in spatial analysis. Considering the low efficiency of the algorithm of indirectly building Voronoi diagram, this paper proposes an improved Voronoi diagram generation algorithm based on Delaunay triangulation of randomly distributed points in the Eu...
متن کاملTime - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملRounding Voronoi Diagram
Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2008
ISSN: 1094-4087
DOI: 10.1364/oe.16.004819